全文获取类型
收费全文 | 5258篇 |
免费 | 428篇 |
国内免费 | 342篇 |
专业分类
化学 | 208篇 |
晶体学 | 2篇 |
力学 | 31篇 |
综合类 | 141篇 |
数学 | 5385篇 |
物理学 | 261篇 |
出版年
2024年 | 10篇 |
2023年 | 99篇 |
2022年 | 145篇 |
2021年 | 123篇 |
2020年 | 205篇 |
2019年 | 234篇 |
2018年 | 226篇 |
2017年 | 202篇 |
2016年 | 128篇 |
2015年 | 95篇 |
2014年 | 180篇 |
2013年 | 457篇 |
2012年 | 197篇 |
2011年 | 309篇 |
2010年 | 305篇 |
2009年 | 455篇 |
2008年 | 401篇 |
2007年 | 285篇 |
2006年 | 332篇 |
2005年 | 227篇 |
2004年 | 207篇 |
2003年 | 177篇 |
2002年 | 171篇 |
2001年 | 153篇 |
2000年 | 108篇 |
1999年 | 101篇 |
1998年 | 93篇 |
1997年 | 66篇 |
1996年 | 46篇 |
1995年 | 53篇 |
1994年 | 44篇 |
1993年 | 27篇 |
1992年 | 26篇 |
1991年 | 16篇 |
1990年 | 13篇 |
1989年 | 18篇 |
1988年 | 18篇 |
1987年 | 9篇 |
1986年 | 4篇 |
1985年 | 14篇 |
1984年 | 15篇 |
1983年 | 5篇 |
1982年 | 10篇 |
1981年 | 4篇 |
1980年 | 3篇 |
1978年 | 1篇 |
1977年 | 4篇 |
1976年 | 1篇 |
1975年 | 3篇 |
1974年 | 2篇 |
排序方式: 共有6028条查询结果,搜索用时 15 毫秒
991.
Irenée Briquel 《Discrete Applied Mathematics》2011,159(1):1-14
We study representations of polynomials over a field K from the point of view of their expressive power. Three important examples for the paper are polynomials arising as permanents of bounded tree-width matrices, polynomials given via arithmetic formulas, and families of so called CNF polynomials. The latter arise in a canonical way from families of Boolean formulas in conjunctive normal form. To each such CNF formula there is a canonically attached incidence graph. Of particular interest to us are CNF polynomials arising from formulas with an incidence graph of bounded tree- or clique-width.We show that the class of polynomials arising from families of polynomial size CNF formulas of bounded tree-width is the same as those represented by polynomial size arithmetic formulas, or permanents of bounded tree-width matrices of polynomial size. Then, applying arguments from communication complexity we show that general permanent polynomials cannot be expressed by CNF polynomials of bounded tree-width. We give a similar result in the case where the clique-width of the incidence graph is bounded, but for this we need to rely on the widely believed complexity theoretic assumption #P?FP/poly. 相似文献
992.
993.
We construct a partial order relation which acts on the set of 3-cliques of a maximal planar graph G and defines a unique hierarchy. We demonstrate that G is the union of a set of special subgraphs, named ‘bubbles’, that are themselves maximal planar graphs. The graph G is retrieved by connecting these bubbles in a tree structure where neighboring bubbles are joined together by a 3-clique. Bubbles naturally provide the subdivision of G into communities and the tree structure defines the hierarchical relations between these communities. 相似文献
994.
Linguists often represent the relationships between words in a collection of text as an undirected graph G=(V,E), where V is the vocabulary and vertices are adjacent in G if and only if the words that they represent co-occur in a relevant pattern in the text. Ideally, the words with similar meanings give rise to the vertices of a component of the graph. However, many words have several distinct meanings, preventing components from characterizing distinct semantic fields. This paper examines how the structural properties of triangular line graphs motivate the use of a clustering coefficient on the triangular line graph, thereby helping to identify polysemous words. The triangular line graph of G, denoted by T(G), is the subgraph of the line graph of G where two vertices are adjacent if the corresponding edges in G belong to a K3. 相似文献
995.
The Merrifield-Simmons index of a graph is defined as the total number of its independent sets, including the empty set. Denote by G(n,k) the set of connected graphs with n vertices and k cut vertices. In this paper, we characterize the graphs with the maximum and minimum Merrifield-Simmons index, respectively, among all graphs in G(n,k) for all possible k values. 相似文献
996.
Birk Eisermann 《Discrete Applied Mathematics》2011,159(17):2165-2169
Golumbic, Monma, and Trotter showed that every tolerance graph for which no vertex neighborhood is contained in another vertex neighborhood is a bounded tolerance graph. We strengthen this result by weakening the neighborhood condition. In this way, more tolerance graphs can be recognized as bounded. Our argument relies on a variation of the concept of “assertive vertices”. 相似文献
997.
We propose a two-component graphical chain model, the discrete regression distribution, where a set of discrete random variables is modeled as a response to a set of categorical and continuous covariates. The proposed model is useful for modeling a set of discrete variables measured at multiple sites along with a set of continuous and/or discrete covariates. The proposed model allows for joint examination of the dependence structure of the discrete response and observed covariates and also accommodates site-to-site variability. We develop the graphical model properties and theoretical justifications of this model. Our model has several advantages over the traditional logistic normal model used to analyze similar compositional data, including site-specific random effect terms and the incorporation of discrete and continuous covariates. 相似文献
998.
Given a connected graph G = (N, E) with node weights s∈? and nonnegative edge lengths, we study the following embedding problem related to an eigenvalue optimization problem over the second smallest eigenvalue of the (scaled) Laplacian of G: Find vi∈?|N|, i∈N so that distances between adjacent nodes do not exceed prescribed edge lengths, the weighted barycenter of all points is at the origin, and is maximized. In the case of a two‐dimensional optimal solution this corresponds to the equilibrium position of a quickly rotating net consisting of weighted mass points that are linked by massless cables of given lengths. We define the rotational dimension of G to be the minimal dimension k so that for all choices of lengths and weights an optimal solution can be found in ?k and show that this is a minor monotone graph parameter. We give forbidden minor characterizations up to rotational dimension 2 and prove that the rotational dimension is always bounded above by the tree‐width of G plus one. © 2010 Wiley Periodicals, Inc. J Graph Theory 66:283‐302, 2011 相似文献
999.
We consider the standard random geometric graph process in which n vertices are placed at random on the unit square and edges are sequentially added in increasing order of edge‐length. For fixed k?1, weprove that the first edge in the process that creates a k‐connected graph coincides a.a.s. with the first edge that causes the graph to contain k/2 pairwise edge‐disjoint Hamilton cycles (for even k), or (k?1)/2 Hamilton cycles plus one perfect matching, all of them pairwise edge‐disjoint (for odd k). This proves and extends a conjecture of Krivelevich and M ler. In the special case when k = 2, our result says that the first edge that makes the random geometric graph Hamiltonian is a.a.s. exactly the same one that gives 2‐connectivity, which answers a question of Penrose. (This result appeared in three independent preprints, one of which was a precursor to this article.) We prove our results with lengths measured using the ?p norm for any p>1, and we also extend our result to higher dimensions. © 2011 Wiley Periodicals, Inc. J Graph Theory 68:299‐322, 2011 相似文献
1000.